// 3_8
// mas substring
#include<iostream>

int main()
{
	const int n = 10;
	int arr[n];
	std::cout << "Enter valuse 15: ";
	for ( int i = 0; i < n; ++i )
	{
		std::cin >> arr[i];
	}

int i = 0;
int count = 1;
int sz_1 = 0;
int sz_2 = 0; 
int arr2[n];
int arr3[n];
int index=0;
while( i < n )
{
	while( arr[i] < arr[ i + 1 ] ) {
		++count;
		arr2[sz_2++] = count;
		i++;
		arr3[ sz_1++ ] = i;
		 	}
	count = 1;
	i++;
}
if( sz_1 <= 1 ){
	std::cout << "No ascending order in massive: ";
}
else {
	int max = arr2[0];
	for( int j = 0; j < sz_1; ++j )
		{
			if( arr2[j] > max ) {
			max = arr2[j]; 
			index=j;
		}
		
	}
	std::cout << "Mas ascendinh number in massive is : " ;
	for( int j = ( arr3[index] - arr2[index] +1 ) ; j <= arr3[index] ; ++j ) 
	{
		std::cout << arr[j] << std::endl;
	}
	}

return 0;
}

